Compactness, Contractibility and Fixed Point Properties of the Pareto Sets in Multi-Objective Programming
نویسندگان
چکیده
منابع مشابه
Contractibility of fixed point sets of auter space
We show that for every finite subgroup G of Aut(Fn), the fixed point subcomplex X n is contractible, where Fn is the free group on n letters and Xn is the spine of “auter space” constructed by Hatcher and Vogtmann in [6]. In more categorical language, Xn = EAut(Fn). This is useful because it allows one to compute (see, for example, [7, 8]) the cohomology of normalizers or centralizers of finite...
متن کاملMulti-objective discounted dynamic programming The Neighbour Search approach to construct Pareto sets of multi-objective Markov Decision Processes
The Neighbour Search (NS) algorithm, is an iterative method for constructing Pareto sets of multi-dimensional polytopes. A NS iteration consists in two steps: Edges Exploration and Neighbour Detection. Edges Exploration takes a Pareto vertex and determines all Pareto edges connecting such a Pareto vertex to its neighbours. Each neighbour is again a Pareto vertex that is obtained by Neighbour De...
متن کاملMulti-objective reinforcement learning using sets of pareto dominating policies
Many real-world problems involve the optimization of multiple, possibly conflicting objectives. Multi-objective reinforcement learning (MORL) is a generalization of standard reinforcement learning where the scalar reward signal is extended to multiple feedback signals, in essence, one for each objective. MORL is the process of learning policies that optimize multiple criteria simultaneously. In...
متن کاملPareto-optimal solutions in fuzzy multi-objective linear programming
The problem of solving multi-objective linear-programming problems, by assuming that the decision maker has fuzzy goals for each of the objective functions, is addressed. Several methods have been proposed in the literature in order to obtain fuzzyefficient solutions to fuzzy multi-objective programming problems. In this paper we show that, in the case that one of our goals is fully achieved, a...
متن کاملPareto Optimal Solution Analysis of Convex Multi-Objective Programming Problem
The main method of solving multi-objective programming is changing multi-objective programming problem into single objective programming problem, and then get Pareto optimal solution. Conversely, whether all Pareto optimal solutions can be obtained through appropriate method, generally the answer is negative. In this paper, the methods of norm ideal point and membership function are used to sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2011
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2011.25073